Informatics Publishing Limited

Beena Bhatia ¹, K. R. Patel ¹, R. P. Tripathi ¹, S. Layek ², H. C. Verma ²

Affiliations
1 Depatment of Physics, Jai Narain Vyas University, Jodhpur 342 001, IN
2 Department of Physics, Indian Institute of Technology, Kanpur 208 016, IN

Abstract

In the present communication, we show that Mössbauer spectra of cumulate eucrites are characteristically different from those of non-cumulate eucrites. In cumulate eucrites, iron occupies only one site, i.e. the M2 site in pyroxene crystal lattice, while it is distributed in both M1 and M2 sites in non-cumulate eucrites. We discuss the importance of asymmetric doublet observed in the Mössbauer spectrum of cumulate body, especially in Vissannapeta cumulate eucrite (fallen in Andhra Pradesh, India), where an appreciable asymmetry was observed. The Mössbauer parameters of diogenite almost exactly replicate those of cumulate eucrites, suggesting that they originate from the same magma ocean. Howardites which are mixed eucrites and diogenites, show iron mineralogy which is different from what one would expect from a physical mixture model. The possible reasons for this difference are also discussed.

Keywords

Cumulate and Non-Cumulate Eucrites, HED Bodies, Mossbauer Spectroscopy, Meteorites.

Full Text

   

H. S. Shukla ¹, R. P. Tripathi ², A. Siddiqui ¹, Vivek Shukla ³

Affiliations
1 Department of Mathematics and Statistics, DDU Gorakhpur University, Gorakhpur - 273009, Uttar Pradesh, IN
2 Department of Mathematics, Graphic Era University, Dehradun - 248002, Uttara Khand, IN
3 Department of Mathematics, MMM Engineering College, Gorakhpur - 273001, Uttar Pradesh, IN

Abstract

In this paper, we develop an EOQ model for power demand under the condition of permissible delay in payment by considering four different situations. Mathematical formulation is derived under these four different situations. The main objective of this work is to obtain minimum total relevant cost. Next, we derive optimal solution optimal cycle time, order quantity and total relevant cost for the proposed model. The theoretical results are illustrated with numerical examples. The sensitivity analysis of the optimal solution is provided with respect to key parameters of the system. Mathematica 5.1 software is used for finding numerical results.

Keywords

Cash Discount, Demand Rate, EOQ Model, Permissible Delay, Total Relevant Cost

Full Text

   

Neelam Tyagi ¹, R. P. Tripathi ¹, A. B. Chandramouli ²

Affiliations
1 Department of Mathematics, Graphic Era University, Dehradu – 248002, Uttarakhand, IN
2 Department of Mathematics, Meerut College, Meerut – 250003, Uttar Pradesh, IN

Abstract

Objectives: In this paper, we consider the Flexible Flowshop Scheduling (FFS) problem with parallel machines. The main objective of this paper is to obtain a good schedule of jobs to minimize the makespan of FFS problem. Methods/Statistical analysis: In this study, two heuristic algorithms have been developed of FFS to reduce the makespan. First, we constructed the new heuristic algorithm based on Minimum Processing Time Selective Approach (MPTSA) and Longest Processing Times (LPT) approach to find the optimal or near optimal sequence for minimization of makespan of FFS problem with parallel machines. Next, we developed the heuristic algorithm using PALMER approach. In the PALMER approach we sequence the jobs based on Longest Slope Value (LSV) and obtained the value of objective function. Findings: We compared both the heuristic algorithms with the help of numerical illustrations. We solved the same numerical by both the heuristic algorithm and result show that our constructed heuristic algorithm has resulted in a better industrial production makespan. The percentage improvement of our constructive heuristic algorithm is also calculated. Gantt chart is also generated to verify the effectiveness of constructed heuristic algorithm. Application/Improvements: Our constructed heuristic algorithm is more effective to reduced the makespan of FFS problems as compare to classic heuristic algorithm as Palmer approach and provide an important tool for decision makers in production management.

Keywords

Flexible Flowshop Scheduling, Gantt Chart, LPT Approach, Makespan, MPTSA Approach, Parallel Machines, Percentage Improvement.

Full Text

   

Neelam Tyagi ¹, R. P. Tripathi ¹, A. B. Chandramouli ²

Affiliations
1 Department of Mathematics, Graphic Era University, Dehradun - 248002, Uttarakhand, IN
2 Department of Mathematics, Meerut College, Meerut - 250001, Uttar Pradesh, IN

Abstract

Objectives: In this paper, Five Dispatching Rules and a Branch & Bound algorithm is introduced for Single Machine Total Tardiness Scheduling Problem (SMTTSP) to minimize the total (average) tardiness and number of tardy jobs. Methods/Statistical Analysis: We proposed five dispatching (priority) rules as Shortest Processing Time, Earliest Due Dates, Longest Processing Time, Minimum Slack Time and First Come First Serve for SMTTSP and compared the performance of all the proposed priority rules. Furthermore, a numerical illustrations is also provided to select the best dispatched rule of SMTTSP. Next, we developed a Branch & Bound Algorithm for SMTTSP using best selected dispatching rule. We also developed Branch Tree to understand the Lower bound process of the B& B Algorithm. Findings: The main aim to proposed these dispatching rules and a Branch and Bound Algorithm is to obtain the optimal sequence to optimize the total (average) tardiness and number of total tardy jobs. The comparative analysis of the dispatching rules shows that EDD rule is better than other dispatching rules for minimization of total tardy jobs and tardiness of the jobs while SPT rule is better for minimization of make span. But Dispatching rules do not have the guarantee to give an optimal solution. So in this study, an exact algorithm (Branch & Bound) was developed with EDD rule for finding the optimal solution for SMTTSP. The comparative study between dispatching rules and an exact (B&B) algorithm is being justified by numerical illustrations and we found that the EDD rule and B&B Algorithm give the same results. Hence it was concluded that EDD rule works as an Exact algorithm and gives the optimal solution for SMTTSP. Application/Improvements: The computational results of the proposed (B&B) algorithm and Dispatching rules show that our methodology is more useful than other optimal approach for SMTTSP and it provides an important tool for decision makers.

Keywords

Average Completion Time, (Average) Tardiness of Jobs, Branch and Bound Algorithm, Branch Tree, No of Tardy Jobs, Single Machine Scheduling.

Full Text

   

Neelam Tyagi ¹, R. P. Tripathi ¹, A. B. Chandramouli ²

Affiliations
1 Department of Mathematics, Graphic Era University, Dehradun – 248002, Uttarakhand, IN
2 Department of Mathematics, Meerut College, Meerut – 250001, Uttar Pradesh, IN

Abstract

Objectives: We proposed two heuristic algorithms for Total Weighted Due Date Tardiness Scheduling (TWDDTS). The main aim of this paper is to optimize the weighted tardiness based criteria. Methods/Statistical Analysis: The first one heuristic algorithm for 'TWDDTS' is based on dispatching rule (EDD-Earliest Due Date) and the second one heuristic algorithm for Modified Total Weighted Due Date Tardiness Scheduling (MTWDDTS) is based on modified weighed due dates. We equated the effectiveness of both the proposed heuristic algorithms with the help of numerical illustrations. Findings: The main aim to propose these heuristic algorithms is to obtain the optimal solution of the problem related to weighted tardiness scheduling based criteria, when processing times of the jobs are also associated with probabilities. These heuristic algorithms are justified by numerical illustrations and comparative study of both the heuristic algorithms (with the help of numerical example) show that an improved heuristic algorithm for MTWDDTS is outperform and give better results than a TWDDTS heuristic algorithm. We also found that when we measure the mean completion time of jobs by both the heuristic algorithms then we observed that the MTWDDTS heuristic algorithm gives the best result as compared to a TWDDTS heuristic algorithm. So we find that MTWDDTS gives the best result for minimization the weighted tardiness based criteria as well as makespan. Application/Improvements: The proposed MTWDDTS algorithm is more useful than the EDD dispatching rule for weighted tardiness based scheduling problems. It is easy to understand and provide an important tool for decision makers.

Keywords

EDD Dispatching Rule, Modified Weighted Due Dates (MWDD), Single Machine Scheduling, Stochastic Processing Time, Weighted Tardiness.

Full Text

   

Neelam Tyagi ¹, R. P. Tripathi ¹, A. B. Chandramouli ²

Affiliations
1 Department of mathematics, Graphic Era University, Dehradun - 248002, Uttarakhand, IN
2 Department of mathematics, Meerut College, Meerut - 250003, Uttar Pradesh, IN

Abstract

Objectives: To find the optimum solution for minimization of bicriterion (makespan, weighted mean flowtime) objective function of three machines flowshop scheduling problem with transportation times and weight of the jobs. Methods/Statistical Analysis: In this paper, we used two types of methodologies first one is based on a Branch and Bound (B&B) technique of exact algorithms and second one is based on Palmer approach of heuristic algorithms. First of all, we originated a new algorithm using B&B technique later on; we developed a new heuristic algorithm using Palmer approach for obtaining the optimal or near optimal sequence to minimize the bicriterion objective function of three machines scheduling problem in flowshop environments with transportation times and weights of the jobs. Comparative study between both the proposed algorithms is also considered to select the best methodology of our bicriterion objective function with the help of numerical illustration. Directed graphs, Gantt chart and Branch Tree are also generated to understand the process of lower bound and effectiveness of proposed algorithms. Findings: We solved the same numerical by constructed Branch & Bound (B&B) algorithm and Palmer based heuristic algorithm. Hence, comparatative result show that our originated B&B algorithm gives the optimal solution or better result as compare to Palmer based heuristic algorithm for minimization of bicriterion (makespan and weighted mean flowtime) objective function. We also calculated the percentage improvement of our constructive B&B algorithm over palmer based new heuristic algorithm and it is examined that constructive B&B algorithm gives the 8.33% improvement in make span and 6.52% improvement in weighted mean flowtime. The directed graph of each computational level is also originated to understand the computational process of the lower bounds easily. The Gantt chart between both the proposed algorithms is also generated to verify the effectiveness of new originated B&B algorithm. Directed graph is also generated of the optimal sequence. Finally, Branch Tree is generated to empathize the process of Lower Bound. Application/Improvements: Our constructed B&B algorithm provide an important tool for decision maker to minimize the makespan and weighted mean flowtime together as bicriterion objective function of three machine flowshop scheduling problems.

Keywords

Algorithm, Branch Tree, Branch & Bound, Directed Graph, Gantt Chart, Makespan, Percentage Improvements, Three Machines Scheduling, Transportation Time, Weighted Mean Flowtime.

Full Text

   

H. S. Shukla ¹, R. P. Tripathi ², M. A. Siddiqui ¹

Affiliations
1 Department of Mathematics and Statistics, DDU, Gorakhpur University, Gorakhpur – 273009, Uttar Pradesh, IN
2 Department of Mathematics, Graphic Era University, Dehradun – 248002, Uttarakhand, IN

Abstract

Objective: In this paper, we consider time dependent demand under constant deterioration. The main objective of this paper is to obtain optimal cycle time which minimizes the total relevant cost. Methods/Statistical Analysis: We know that every business refers to the input- out relation. If the firm expands output by employing more and more the variable input, it alters the proportion between fixed and variable inputs. In this study, the truncated Taylor’s series approximations are used for exponential terms to find closed form numerical solution. The optimal value of cycle time is obtained by differentiating cost function. Findings: We compared all results with the optimal solution we also show that the total relevant cost function in minimum. Mathematical models are established to validate the proposed model considering four different situations i.e. case (1) T ≥ M1 Case (2) T < M1. Case (3) T ≥ M2 and case (4) T < M2. Application/Improvements: Capital is the most essential element of production process. At present inflation plays a crucial role in each type of business transaction. Numerical examples are given for four different situations, those show that the validity of the model. Sensitive analysis is included for different parameters. Cost is a factor which is directly related to production cost analysis helps in achieving high quality production at low cost.

Keywords

Credit Period, Deterioration, EOQ Model, Optimal, Time Discounting, Time Sensitive Demand

Full Text

   

R. P. Tripathi ¹, Ambesh Dixit ², N. Bhandari ³

Affiliations
1 78, BGT Extension, Jodhpur 342 005, IN
2 Department of Physics, Indian Institute of Technology, Jodhpur 342 005, IN
3 Basic Sciences Research Institute, Navrangpura, Ahmedabad 380 009, IN

Abstract

Two meteorite fragments collected from the Mukundpura impact site, Rajasthan, India have been analysed using scanning electron microscopy, energy dispersive X-ray spectroscopy, Mössbauer spectroscopy, thermogravimetric analysis (TGA) and Raman spectroscopy. High Fe (22.65 wt%), Ni (1.53%) and S (3.69%) and concentrations of other elements obtained by X-ray analysis indicate that it is a carbonaceous chondrite. Mossbauer spectra show similarity with those obtained from Cold Bokkeveld and Murchison carbonaceous chondrites, and this analogy allows us to classify it as belonging to CM group of carbonaceous chondrites. TGA shows large weight loss, implying presence of significant amount of volatiles in this meteorite and Raman spectroscopy shows the presence of abundant organic matter consisting of disordered and aromatic (graphitic or polyaromatic) carbon. These results indicate that Mukundpura meteorite is a rare type of extraterrestrial object deserving further in-depth studies.

Keywords

Carbonaceous Chondrite, Chemical Composition, Meteorite Fragments, Spectral Analysis.

Full Text